ALGORITHMS FOR CALCULATION NETWORK SCEDULES SET BY FAMILY OF NODAL SUBSETS
نویسندگان
چکیده
منابع مشابه
study of cohesive devices in the textbook of english for the students of apsychology by rastegarpour
this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...
Efficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملCamparison of Numerically Stability of Two Algorithms for the Calculation of Variance
In descriptive statistics, there are two computational algorithms for determining the variance S2, of a set of observations : Algorithm 1: S2= - , Algorithm 2: S2= , where . It is interesting to discuss, which of the above formulas is numerically more trustworthy in machine numbers sets. I this paper, based on total effect of rounding error, we prove that the second Algorithm is better...
متن کاملDevelopment of a Set of Algorithms for the Multi-Project Scheduling Problems
In this paper, the problem of determining the best schedule for a set of projects has been modeled in the form of a generalized tardiness flowshop (GTF) problem. We develop a set of heuristic algorithms for minimizing the total tardiness of jobs in a GTF problem. In the generalized version of tardiness flowshop problems, a job is considered to be a collection of operations and there is a due da...
متن کاملA Set of Algorithms for Solving the Generalized Tardiness Flowshop Problems
This paper considers the problem of scheduling n jobs in the generalized tardiness flow shop problem with m machines. Seven algorithms are developed for finding a schedule with minimum total tardiness of jobs in the generalized flow shop problem. Two simple rules, the shortest processing time (SPT), and the earliest due date (EDD) sequencing rules, are modified and employed as the core of seque...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science-based technologies
سال: 2010
ISSN: 2310-5461,2075-0781
DOI: 10.18372/2310-5461.6.5210